1‐independent percolation on ℤ2×Kn
نویسندگان
چکیده
منابع مشابه
On Lundh’s Percolation Diffusion
A collection of spherical obstacles in the unit ball in Euclidean space is said to be avoidable for Brownian motion if there is a positive probability that Brownian motion diffusing from some point in the ball will avoid all the obstacles and reach the boundary of the ball. The centres of the spherical obstacles are generated according to a Poisson point process while the radius of an obstacle ...
متن کاملPercolation on Fuchsian
A simple numerical calculation shows that for m = 5, m (p) > 1 and m (p) > 1 for all :6615 p :6665. Since m (p) and m (p) are clearly monotone in m, the same is true for all m 5. Thus, both Galton-Watson processes Y n and Y 0 n are supercritical when :6615 p :6665. It follows that with positive P p ?probability there is red sector percolation and blue sector percolation.
متن کاملPercolation on sparse networks
We study percolation on networks, which is used as a model of the resilience of networked systems such as the Internet to attack or failure and as a simple model of the spread of disease over human contact networks. We reformulate percolation as a message passing process and demonstrate how the resulting equations can be used to calculate, among other things, the size of the percolating cluster...
متن کاملPercolation on Grigorchuk groups
Let pc(G) be the critical probability of the site percolation on the Cayley graph of groupG. In [2] of Benjamini and Schramm conjectured thatpc < 1, given the group is infinite and not a finite extension of Z. The conjecture was proved earlier for groups of polynomial and exponential growth and remains open for groups of intermediate growth. In this note we prove the conjecture for a special cl...
متن کاملPercolation on correlated networks.
We reconsider the problem of percolation on an equilibrium random network with degree-degree correlations between nearest-neighboring vertices focusing on critical singularities at a percolation threshold. We obtain criteria for degree-degree correlations to be irrelevant for critical singularities. We present examples of networks in which assortative and disassortative mixing leads to unusual ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures and Algorithms
سال: 2022
ISSN: ['1042-9832', '1098-2418']
DOI: https://doi.org/10.1002/rsa.21129